package leetcode.code0827;

import leetcode.IDebug;
import leetcode.helper.HelpDebug;

public abstract class Solution827 implements IDebug {
	public abstract int largestIsland(int[][] grid);

	@Override
	public void debug1() {
		int[][] grid = HelpDebug.str2array1("[[1,0],[0,1]]");
		int r = this.largestIsland(grid);
		int e = 3;
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug2() {
		int[][] grid = HelpDebug.str2array1("[[1,1],[1,0]]");
		int r = this.largestIsland(grid);
		int e = 4;
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug3() {
		int[][] grid = HelpDebug.str2array1("[[1,1],[1,1]]");
		int r = this.largestIsland(grid);
		int e = 4;
		HelpDebug.compare(e, r);
	}
	public void debug5() {
		int[][] grid = HelpDebug.str2array1("[[0,0],[0,0]]");
		int r = this.largestIsland(grid);
		int e = 1;
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug4() {
		int[][] grid = HelpDebug.str2array1("[[1,1],[1,1]]");
		int r = this.largestIsland(grid);
		int e = 4;
		HelpDebug.compare(e, r);
	}

}
